Competition-driven modeling of temporal networks

Abstract We study the problem of modeling temporal networks constrained by size a concurrent set, characteristic shown to be important in many application areas, e.g., transportation, social, process, and other networks. propose competition-driven model for generation such Our method carries out turns competitions along timeline where each node network is labeled with probability gain outgoing edges competitions. present thorough theoretical analysis investigate cardinality degree distributions generated experimental results demonstrate that our simulates real-world well generates efficiently at scale.